#include"Chain Binary Tree.h"
#include"Queue.h"
void test1(BTNode* root)
{
	int size = BinaryTreeSize(root);
	int count = BinaryTreeLeafSize(root);
	int knum = BinaryTreeLevelKSize(root, 4);
	BTNode* record = BinaryTreeFind(root, 'C');

	printf("%d\n", size);

	printf("%d\n", count);
	printf("%d\n", knum);
	printf("%c - ", record->data);
	printf("%c - ", record->left->data);
	printf("%c - ", record->right->data);
	BinaryTreePrevOrder(root);
	printf("\n");
	BinaryTreeInOrder(root);
	printf("\n");
	BinaryTreePostOrder(root);
	printf("\n");
}
void test2(BTNode* root)
{
	BinaryTreeLevelOrder(root);
}
int main()
{
	BTDataType str[18] = "ABD##E#H##CF##G##";
	int n = 0;
	BTNode* root = (BTNode*)malloc(sizeof(BTNode)*18);
	root=BinaryTreeCreate(root,str,&n);
	//test1(root);
	test2(root);
	return 0;
}